首页> 外文OA文献 >FemtoCaching: Wireless Video Content Delivery through Distributed Caching Helpers
【2h】

FemtoCaching: Wireless Video Content Delivery through Distributed Caching Helpers

机译:FemtoCaching:通过分布式传输无线视频内容   缓存助手

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Video on-demand streaming from Internet-based servers is becoming one of themost important services offered by wireless networks today. In order to improvethe area spectral efficiency of video transmission in cellular systems, smallcells heterogeneous architectures (e.g., femtocells, WiFi off-loading) arebeing proposed, such that video traffic to nomadic users can be handled byshort-range links to the nearest small cell access points (referred to as"helpers"). As the helper deployment density increases, the backhaul capacitybecomes the system bottleneck. In order to alleviate such bottleneck we proposea system where helpers with low-rate backhaul but high storage capacity cachepopular video files. Files not available from helpers are transmitted by thecellular base station. We analyze the optimum way of assigning files to thehelpers, in order to minimize the expected downloading time for files. Wedistinguish between the uncoded case (where only complete files are stored) andthe coded case, where segments of Fountain-encoded versions of the video filesare stored at helpers. We show that the uncoded optimum file assignment isNP-hard, and develop a greedy strategy that is provably within a factor 2 ofthe optimum. Further, for a special case we provide an efficient algorithmachieving a provably better approximation ratio of $1-(1-1/d)^d$, where $d$ isthe maximum number of helpers a user can be connected to. We also show that thecoded optimum cache assignment problem is convex that can be further reduced toa linear program. We present numerical results comparing the proposed schemes.
机译:来自基于Internet的服务器的视频点播流正在成为当今无线网络提供的最重要的服务之一。为了提高蜂窝系统中视频传输的区域频谱效率,正在提出小型小区异构架构(例如,毫微微小区,WiFi卸载),以便可以通过到最近的小型小区访问的短距离链接来处理流向游牧用户的视频业务。点(称为“帮助者”)。随着助手部署密度的增加,回程容量成为系统瓶颈。为了减轻这种瓶颈,我们提出了一种系统,在该系统中,具有低速率回程但具有高存储容量的帮助者缓存受欢迎的视频文件。辅助者无法获得的文件由蜂窝基站传输。我们分析了将文件分配给帮助者的最佳方法,以最大程度地减少文件的预期下载时间。区分未编码的情况(仅存储完整文件)和已编码的情况(其中,视频文件的Fountain编码版本的片段存储在帮助程序中)。我们表明,未编码的最佳文件分配是NP难的,并开发了一种可证明在最佳因子2之内的贪婪策略。此外,对于特殊情况,我们提供了一种有效的算法,可实现更好的逼近比$ 1-(1-1 / d)^ d $,其中$ d $是用户可以连接的最大助手数。我们还表明,编码的最佳高速缓存分配问题是凸的,可以进一步简化为线性程序。我们提出了数值结果,比较了所提出的方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号